Tiles, Rewriting Rules and CCS
نویسندگان
چکیده
منابع مشابه
Tiles, rewriting rules and CCS
In 12] we introduced the tile model, a framework encompassing a wide class of computational systems, whose behaviour can be described by certain rewriting rules. We gathered our inspiration both from the world of term rewriting and of con-currency theory, and our formalism recollects many properties of these sources. For example, it provides a compositional way to describe both the states and t...
متن کاملTiles , Rewriting Rules and CCS 1
In 12] we introduced the tile model, a framework encompassing a wide class of computational systems, whose behaviour can be described by certain rewriting rules. We gathered our inspiration both from the world of term rewriting and of con-currency theory, and our formalism recollects many properties of these sources. For example, it provides a compositional way to describe both the states and t...
متن کاملSynthesising CCS bisimulation using graph rewriting
Article history: Received 23 August 2007 Revised 17 September 2008 Available online 20 November 2008 The paper presents a case study on the synthesis of labelled transition systems (ltss) for process calculi, choosing as testbed Milner’s Calculus of Communicating System (ccs). The proposal is based on a graphical encoding: each ccs process is mapped into a graph equipped with suitable interface...
متن کاملCCS semantics via proved transition systems and rewriting logic
We consider (a slight variant of) the ccs calculus, and we analyze two operational semantics deened in the literature: the rst exploits Proved Transition Systems (pts) and the second Rewriting Logic (rl). We show that the interleaving interpretation of both semantics agree, in that they deene the same transitions and exhibit the same nondeterministic structure. In addition, we study causality i...
متن کاملGraph Rewriting, Constraint Solving and Tiles for Coordinating Distributed Systems
In this paper we describe an approach to model the dynamics of distributed systems. For distributed systems we mean systems consisting of concurrent processes communicating via shared ports and posing certain synchronization requirements, via the ports, to the adjacent processes. The basic idea is to use graphs to represent states of such systems, and graph rewriting to represent their evolutio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 1996
ISSN: 1571-0661
DOI: 10.1016/s1571-0661(04)00030-1